Method and apparatus for video coding

ABSTRACT

Aspects of the disclosure provide a method and an apparatus for video coding. In some examples, an apparatus includes processing circuitry that divides a current block into a plurality of sub-blocks, derives a plurality of pieces of sub-block motion information for the plurality of sub-blocks, generates predicted sub-block samples for the sub-blocks according to the pieces of sub-block motion information, and generates a predicted block for the current block according to a combination of the predicted sub-block samples. The processing circuitry also selects a piece of the sub-block motion information from the pieces of sub-block motion information as representative motion information for the current block, and stores the representative motion information in a history-based motion vector prediction (HMVP) buffer.

INCORPORATION BY REFERENCE

This present application is a continuation U.S. application Ser. No. 16/808,213, filed Mar. 3, 2020, which claims the benefit of priority to U.S. Provisional Application No. 62/814,536, “METHOD OF HMVP BUFFER UPDATING” filed on Mar. 6, 2019. The entire disclosures of the prior applications are hereby incorporated by reference in their entirety.

TECHNICAL FIELD

The present disclosure describes embodiments generally related to video coding.

BACKGROUND

The background description provided herein is for the purpose of generally presenting the context of the disclosure. Work of the presently named inventors, to the extent the work is described in this background section, as well as aspects of the description that may not otherwise qualify as prior art at the time of filing, are neither expressly nor impliedly admitted as prior art against the present disclosure.

Video coding and decoding can be performed using inter-picture prediction with motion compensation. Uncompressed digital video can include a series of pictures, each picture having a spatial dimension of, for example, 1920×1080 luminance samples and associated chrominance samples. The series of pictures can have a fixed or variable picture rate (informally also known as frame rate), of, for example 60 pictures per second or 60 Hz. Uncompressed video has significant bitrate requirements. For example, 1080p60 4:2:0 video at 8 bit per sample (1920×1080 luminance sample resolution at 60 Hz frame rate) requires close to 1.5 Gbit/s bandwidth. An hour of such video requires more than 600 GBytes of storage space.

One purpose of video coding and decoding can be the reduction of redundancy in the input video signal, through compression. Compression can help reduce the aforementioned bandwidth or storage space requirements, in some cases by two orders of magnitude or more. Both lossless and lossy compression, as well as a combination thereof can be employed. Lossless compression refers to techniques where an exact copy of the original signal can be reconstructed from the compressed original signal. When using lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. In the case of video, lossy compression is widely employed. The amount of distortion tolerated depends on the application; for example, users of certain consumer streaming applications may tolerate higher distortion than users of television distribution applications. The compression ratio achievable can reflect that: higher allowable/tolerable distortion can yield higher compression ratios.

Motion compensation can be a lossy compression technique and can relate to techniques where a block of sample data from a previously reconstructed picture or part thereof (reference picture), after being spatially shifted in a direction indicated by a motion vector (MV henceforth), is used for the prediction of a newly reconstructed picture or picture part. In some cases, the reference picture can be the same as the picture currently under reconstruction. MVs can have two dimensions X and Y, or three dimensions, the third being an indication of the reference picture in use (the latter, indirectly, can be a time dimension).

In some video compression techniques, an MV applicable to a certain area of sample data can be predicted from other MVs, for example from those related to another area of sample data spatially adjacent to the area under reconstruction, and preceding that MV in decoding order. Doing so can substantially reduce the amount of data required for coding the MV, thereby removing redundancy and increasing compression. MV prediction can work effectively, for example, because when coding an input video signal derived from a camera (known as natural video) there is a statistical likelihood that areas larger than the area to which a single MV is applicable move in a similar direction and, therefore, can in some cases be predicted using a similar motion vector derived from MVs of neighboring area. That results in the MV found for a given area to be similar or the same as the MV predicted from the surrounding MVs, and that in turn can be represented, after entropy coding, in a smaller number of bits than what would be used if coding the MV directly. In some cases, MV prediction can be an example of lossless compression of a signal (namely: the MVs) derived from the original signal (namely: the sample stream). In other cases, MV prediction itself can be lossy, for example because of rounding errors when calculating a predictor from several surrounding MVs.

Various MV prediction mechanisms are described in H.265/HEVC (ITU-T Rec. H.265, “High Efficiency Video Coding”, December 2016). Out of the many MV prediction mechanisms that H.265 offers, described herein is a technique henceforth referred to as “spatial merge”.

Referring to FIG. 1, a current block (101) comprises samples that have been found by the encoder during the motion search process to be predictable from a previous block of the same size that has been spatially shifted. Instead of coding that MV directly, the MV can be derived from metadata associated with one or more reference pictures, for example from the most recent (in decoding order) reference picture, using the MV associated with either one of five neighboring blocks, denoted A0, A1, and B0, B1, B2 (102 through 106, respectively). In H.265, the MV prediction can use predictors from the same reference picture that the neighboring block is using.

SUMMARY

Aspects of the disclosure provide methods and apparatuses for video encoding/decoding. In some examples, an apparatus includes processing circuitry that divides a current block into a plurality of sub-blocks, derives a plurality of pieces of sub-block motion information for the plurality of sub-blocks, generates predicted sub-block samples for the sub-blocks according to the pieces of sub-block motion information, and generates a predicted block for the current block according to a combination of the predicted sub-block samples. The processing circuitry also selects a piece of the sub-block motion information from the pieces of sub-block motion information as representative motion information for the current block, and stores the representative motion information in a history-based motion vector prediction (HMVP) buffer.

In some embodiments, the selected piece of sub-block motion information is for a sub-block of the sub-blocks that is at a particular position in the current block. In some examples, the particular sub-block can be at a bottom-right position in the current block. In some examples, the particular sub-block can be adjacent to a center position of the current block. In at least on example, an upper-left corner of the particular sub-block is at the center position of the current block.

In some embodiments, the processing circuitry further determines the particular position according to control information transmitted in a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), slice header, tile group header, or tile header.

In some embodiments, the current block is coded according to one of affine inter prediction, subblock-based temporal motion vector prediction, and triangular inter prediction.

Aspects of the disclosure also provide a non-transitory computer-readable medium storing instructions which when executed by a computer for video decoding cause the computer to perform any one or a combination of the methods for video decoding.

BRIEF DESCRIPTION OF THE DRAWINGS

Further features, the nature, and various advantages of the disclosed subject matter will be more apparent from the following detailed description and the accompanying drawings in which:

FIG. 1 is a schematic illustration of a current block and its surrounding spatial merge candidates in one example.

FIG. 2 is a schematic illustration of a simplified block diagram of a communication system (200) in accordance with an embodiment.

FIG. 3 is a schematic illustration of a simplified block diagram of a communication system (300) in accordance with an embodiment.

FIG. 4 is a schematic illustration of a simplified block diagram of a decoder in accordance with an embodiment.

FIG. 5 is a schematic illustration of a simplified block diagram of an encoder in accordance with an embodiment.

FIG. 6 shows a block diagram of an encoder in accordance with another embodiment.

FIG. 7 shows a block diagram of a decoder in accordance with another embodiment.

FIG. 8 is a schematic illustration of a current block and corresponding merge candidates according to a merge mode in accordance with an embodiment.

FIG. 9 is a schematic illustration of spatial neighboring blocks and a temporal neighboring block for a current block in accordance with an embodiment.

FIG. 10A is a schematic illustration of spatial neighboring blocks that can be used to determine predicted motion information for a current block using a subblock-based temporal motion vector prediction method in accordance with one embodiment.

FIG. 10B is a schematic illustration of a selected spatial neighboring block for a subblock-based temporal motion vector prediction method in accordance with one embodiment.

FIG. 11A is a flow chart outlining a process of constructing and updating a list of motion information candidates using a history-based motion vector prediction method in accordance with one embodiment.

FIG. 11B is a schematic illustration of updating the list of motion information candidates using the history-based motion vector prediction method in accordance with one embodiment.

FIG. 12 is a schematic illustration of determining starting points at two reference pictures associated with two reference picture lists based on motion vectors of a merge candidate in a merge with motion vector difference (MMVD) mode in accordance with an embodiment.

FIG. 13 is a schematic illustration of predetermined points surrounding two starting points that are to be evaluated in the MMVD mode in accordance with an embodiment.

FIGS. 14A-14B show examples of merge sharing regions in accordance with an embodiment.

FIG. 15A is a schematic illustration of two splitting examples for a current block according to a triangle prediction mode in accordance with one embodiment.

FIG. 15B shows an example of spatial and temporal neighboring blocks used to construct a uni-prediction candidate list for a triangular prediction mode in accordance with an embodiment.

FIG. 16A shows an example of a coding unit applying a set of weighting factors in an adaptive blending process in accordance with an embodiment.

FIG. 16B shows an example of a coding unit applying a set of weighting factors in an adaptive blending process in accordance with an embodiment.

FIG. 17A shows an example of a coding unit that uses the piece of sub-block motion information for a sub-block that is at a bottom-right position in the current block in accordance with an embodiment.

FIG. 17B shows an example of a coding unit that uses the piece of sub-block motion information for a sub-block that is at a center position in the current block in accordance with an embodiment.

FIG. 18 shows a flow chart outlining a process according to some embodiments of the disclosure.

FIG. 19 is a schematic illustration of a computer system in accordance with an embodiment.

DETAILED DESCRIPTION OF EMBODIMENTS

I. Video Coding Encoder and Decoder

FIG. 2 illustrates a simplified block diagram of a communication system (200) according to an embodiment of the present disclosure. The communication system (200) includes a plurality of terminal devices that can communicate with each other, via, for example, a network (250). For example, the communication system (200) includes a first pair of terminal devices (210) and (220) interconnected via the network (250). In the FIG. 2 example, the first pair of terminal devices (210) and (220) performs unidirectional transmission of data. For example, the terminal device (210) may code video data (e.g., a stream of video pictures that are captured by the terminal device (210)) for transmission to the other terminal device (220) via the network (250). The encoded video data can be transmitted in the form of one or more coded video bitstreams. The terminal device (220) may receive the coded video data from the network (250), decode the coded video data to recover the video pictures, and display video pictures according to the recovered video data. Unidirectional data transmission may be common in media serving applications and the like.

In another example, the communication system (200) includes a second pair of terminal devices (230) and (240) that performs bidirectional transmission of coded video data that may occur, for example, during videoconferencing. For bidirectional transmission of data, in an example, each terminal device of the terminal devices (230) and (240) may code video data (e.g., a stream of video pictures that are captured by the terminal device) for transmission to the other terminal device of the terminal devices (230) and (240) via the network (250). Each terminal device of the terminal devices (230) and (240) also may receive the coded video data transmitted by the other terminal device of the terminal devices (230) and (240), and may decode the coded video data to recover the video pictures and may display video pictures at an accessible display device according to the recovered video data.

In the FIG. 2 example, the terminal devices (210), (220), (230), and (240) may be illustrated as servers, personal computers, and smart phones, but the principles of the present disclosure may be not so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players, and/or dedicated video conferencing equipment. The network (250) represents any number of networks that convey coded video data among the terminal devices (210), (220), (230), and (240), including for example wireline (wired) and/or wireless communication networks. The communication network (250) may exchange data in circuit-switched and/or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks, and/or the Internet. For the purposes of the present discussion, the architecture and topology of the network (250) may be immaterial to the operation of the present disclosure unless explained herein below.

FIG. 3 illustrates, as an example for an application for the disclosed subject matter, the placement of a video encoder and a video decoder in a streaming environment. The disclosed subject matter can be equally applicable to other video enabled applications, including, for example, video conferencing, digital TV, storing of compressed video on digital media including CD, DVD, memory stick and the like, and so on.

A streaming system may include a capture subsystem (313) that can include a video source (301), for example a digital camera, creating for example a stream of video pictures (302) that are uncompressed. In an example, the stream of video pictures (302) includes samples that are taken by the digital camera. The stream of video pictures (302), depicted as a bold line to emphasize a high data volume when compared to encoded video data (304) (or coded video bitstreams), can be processed by an electronic device (320) that includes a video encoder (303) coupled to the video source (301). The video encoder (303) can include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter as described in more detail below. The encoded video data (304) (or encoded video bitstream (304)), depicted as a thin line to emphasize the lower data volume when compared to the stream of video pictures (302), can be stored on a streaming server (305) for future use. One or more streaming client subsystems, such as client subsystems (306) and (308) in FIG. 3, can access the streaming server (305) to retrieve copies (307) and (309) of the encoded video data (304). A client subsystem (306) can include a video decoder (310), for example, in an electronic device (330). The video decoder (310) decodes the incoming copy (307) of the encoded video data and creates an outgoing stream of video pictures (311) that can be rendered on a display (312) (e.g., display screen) or other rendering device (not depicted). In some streaming systems, the encoded video data (304), (307), and (309) (e.g., video bitstreams) can be encoded according to certain video coding/compression standards. Examples of those standards include ITU-T Recommendation H.265. In an example, a video coding standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC.

It is noted that the electronic devices (320) and (330) can include other components (not shown). For example, the electronic device (320) can include a video decoder (not shown) and the electronic device (330) can include a video encoder (not shown) as well.

FIG. 4 shows a block diagram of a video decoder (410) according to an embodiment of the present disclosure. The video decoder (410) can be included in an electronic device (430). The electronic device (430) can include a receiver (431) (e.g., receiving circuitry). The video decoder (410) can be used in the place of the video decoder (310) in the FIG. 3 example.

The receiver (431) may receive one or more coded video sequences to be decoded by the video decoder (410); in the same or another embodiment, one coded video sequence at a time, where the decoding of each coded video sequence is independent from other coded video sequences. The coded video sequence may be received from a channel (401), which may be a hardware/software link to a storage device which stores the encoded video data. The receiver (431) may receive the encoded video data with other data, for example, coded audio data and/or ancillary data streams, that may be forwarded to their respective using entities (not depicted). The receiver (431) may separate the coded video sequence from the other data. To combat network jitter, a buffer memory (415) may be coupled in between the receiver (431) and an entropy decoder/parser (420) (“parser (420)” henceforth). In certain applications, the buffer memory (415) is part of the video decoder (410). In others, it can be outside of the video decoder (410) (not depicted). In still others, there can be a buffer memory (not depicted) outside of the video decoder (410), for example to combat network jitter, and in addition another buffer memory (415) inside the video decoder (410), for example to handle playout timing. When the receiver (431) is receiving data from a store/forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (415) may not be needed, or can be small. For use on best effort packet networks such as the Internet, the buffer memory (415) may be required, can be comparatively large and can be advantageously of adaptive size, and may at least partially be implemented in an operating system or similar elements (not depicted) outside of the video decoder (410).

The video decoder (410) may include the parser (420) to reconstruct symbols (421) from the coded video sequence. Categories of those symbols include information used to manage operation of the video decoder (410), and potentially information to control a rendering device such as a render device (412) (e.g., a display screen) that is not an integral part of the electronic device (430) but can be coupled to the electronic device (430), as was shown in FIG. 4. The control information for the rendering device(s) may be in the form of Supplemental Enhancement Information (SEI messages) or Video Usability Information (VUI) parameter set fragments (not depicted). The parser (420) may parse/entropy-decode the coded video sequence that is received. The coding of the coded video sequence can be in accordance with a video coding technology or standard, and can follow various principles, including variable length coding, Huffman coding, arithmetic coding with or without context sensitivity, and so forth. The parser (420) may extract from the coded video sequence, a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder, based upon at least one parameter corresponding to the group. Subgroups can include Groups of Pictures (GOPs), pictures, tiles, slices, macroblocks, Coding Units (CUs), blocks, Transform Units (TUs), Prediction Units (PUs) and so forth. The parser (420) may also extract from the coded video sequence information such as transform coefficients, quantizer parameter values, motion vectors, and so forth.

The parser (420) may perform an entropy decoding/parsing operation on the video sequence received from the buffer memory (415), so as to create symbols (421).

Reconstruction of the symbols (421) can involve multiple different units depending on the type of the coded video picture or parts thereof (such as: inter and intra picture, inter and intra block), and other factors. Which units are involved, and how, can be controlled by the subgroup control information that was parsed from the coded video sequence by the parser (420). The flow of such subgroup control information between the parser (420) and the multiple units below is not depicted for clarity.

Beyond the functional blocks already mentioned, the video decoder (410) can be conceptually subdivided into a number of functional units as described below. In a practical implementation operating under commercial constraints, many of these units interact closely with each other and can, at least partly, be integrated into each other. However, for the purpose of describing the disclosed subject matter, the conceptual subdivision into the functional units below is appropriate.

A first unit is the scaler/inverse transform unit (451). The scaler/inverse transform unit (451) receives a quantized transform coefficient as well as control information, including which transform to use, block size, quantization factor, quantization scaling matrices, etc. as symbol(s) (421) from the parser (420). The scaler/inverse transform unit (451) can output blocks comprising sample values, that can be input into aggregator (455).

In some cases, the output samples of the scaler/inverse transform (451) can pertain to an intra coded block; that is: a block that is not using predictive information from previously reconstructed pictures, but can use predictive information from previously reconstructed parts of the current picture. Such predictive information can be provided by an intra picture prediction unit (452). In some cases, the intra picture prediction unit (452) generates a block of the same size and shape of the block under reconstruction, using surrounding already reconstructed information fetched from the current picture buffer (458). The current picture buffer (458) buffers, for example, partly reconstructed current picture and/or fully reconstructed current picture. The aggregator (455), in some cases, adds, on a per sample basis, the prediction information the intra prediction unit (452) has generated to the output sample information as provided by the scaler/inverse transform unit (451).

In other cases, the output samples of the scaler/inverse transform unit (451) can pertain to an inter coded, and potentially motion compensated block. In such a case, a motion compensation prediction unit (453) can access reference picture memory (457) to fetch samples used for prediction. After motion compensating the fetched samples in accordance with the symbols (421) pertaining to the block, these samples can be added by the aggregator (455) to the output of the scaler/inverse transform unit (451) (in this case called the residual samples or residual signal) so as to generate output sample information. The addresses within the reference picture memory (457) from where the motion compensation prediction unit (453) fetches prediction samples can be controlled by motion vectors, available to the motion compensation prediction unit (453) in the form of symbols (421) that can have, for example X, Y, and reference picture components. Motion compensation also can include interpolation of sample values as fetched from the reference picture memory (457) when sub-sample exact motion vectors are in use, motion vector prediction mechanisms, and so forth.

The output samples of the aggregator (455) can be subject to various loop filtering techniques in the loop filter unit (456). Video compression technologies can include in-loop filter technologies that are controlled by parameters included in the coded video sequence (also referred to as coded video bitstream) and made available to the loop filter unit (456) as symbols (421) from the parser (420), but can also be responsive to meta-information obtained during the decoding of previous (in decoding order) parts of the coded picture or coded video sequence, as well as responsive to previously reconstructed and loop-filtered sample values.

The output of the loop filter unit (456) can be a sample stream that can be output to the render device (412) as well as stored in the reference picture memory (457) for use in future inter-picture prediction.

Certain coded pictures, once fully reconstructed, can be used as reference pictures for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (by, for example, the parser (420)), the current picture buffer (458) can become a part of the reference picture memory (457), and a fresh current picture buffer can be reallocated before commencing the reconstruction of the following coded picture.

The video decoder (410) may perform decoding operations according to a predetermined video compression technology in a standard, such as ITU-T Rec. H.265. The coded video sequence may conform to a syntax specified by the video compression technology or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technology or standard and the profiles as documented in the video compression technology or standard. Specifically, a profile can select certain tools as the only tools available for use under that profile from all the tools available in the video compression technology or standard. Also necessary for compliance can be that the complexity of the coded video sequence is within bounds as defined by the level of the video compression technology or standard. In some cases, levels restrict the maximum picture size, maximum frame rate, maximum reconstruction sample rate (measured in, for example megasamples per second), maximum reference picture size, and so on. Limits set by levels can, in some cases, be further restricted through Hypothetical Reference Decoder (HRD) specifications and metadata for HRD buffer management signaled in the coded video sequence.

In an embodiment, the receiver (431) may receive additional (redundant) data with the encoded video. The additional data may be included as part of the coded video sequence(s). The additional data may be used by the video decoder (410) to properly decode the data and/or to more accurately reconstruct the original video data. Additional data can be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, and so on.

FIG. 5 shows a block diagram of a video encoder (503) according to an embodiment of the present disclosure. The video encoder (503) is included in an electronic device (520). The electronic device (520) includes a transmitter (540) (e.g., transmitting circuitry). The video encoder (503) can be used in the place of the video encoder (303) in the FIG. 3 example.

The video encoder (503) may receive video samples from a video source (501) (that is not part of the electronic device (520) in the FIG. 5 example) that may capture video image(s) to be coded by the video encoder (503). In another example, the video source (501) is a part of the electronic device (520).

The video source (501) may provide the source video sequence to be coded by the video encoder (503) in the form of a digital video sample stream that can be of any suitable bit depth (for example: 8 bit, 10 bit, 12 bit, . . . ), any colorspace (for example, BT.601 Y CrCB, RGB, . . . ), and any suitable sampling structure (for example Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (501) may be a storage device storing previously prepared video. In a videoconferencing system, the video source (501) may be a camera that captures local image information as a video sequence. Video data may be provided as a plurality of individual pictures that impart motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, wherein each pixel can comprise one or more samples depending on the sampling structure, color space, etc. in use. A person skilled in the art can readily understand the relationship between pixels and samples. The description below focuses on samples.

According to an embodiment, the video encoder (503) may code and compress the pictures of the source video sequence into a coded video sequence (543) in real time or under any other time constraints as required by the application. Enforcing appropriate coding speed is one function of a controller (550). In some embodiments, the controller (550) controls other functional units as described below and is functionally coupled to the other functional units. The coupling is not depicted for clarity. Parameters set by the controller (550) can include rate control related parameters (picture skip, quantizer, lambda value of rate-distortion optimization techniques, . . . ), picture size, group of pictures (GOP) layout, maximum motion vector search range, and so forth. The controller (550) can be configured to have other suitable functions that pertain to the video encoder (503) optimized for a certain system design.

In some embodiments, the video encoder (503) is configured to operate in a coding loop. As an oversimplified description, in an example, the coding loop can include a source coder (530) (e.g., responsible for creating symbols, such as a symbol stream, based on an input picture to be coded, and a reference picture(s)), and a (local) decoder (533) embedded in the video encoder (503). The decoder (533) reconstructs the symbols to create the sample data in a similar manner as a (remote) decoder also would create (as any compression between symbols and coded video bitstream is lossless in the video compression technologies considered in the disclosed subject matter). The reconstructed sample stream (sample data) is input to the reference picture memory (534). As the decoding of a symbol stream leads to bit-exact results independent of decoder location (local or remote), the content in the reference picture memory (534) is also bit exact between the local encoder and remote encoder. In other words, the prediction part of an encoder “sees” as reference picture samples exactly the same sample values as a decoder would “see” when using prediction during decoding. This fundamental principle of reference picture synchronicity (and resulting drift, if synchronicity cannot be maintained, for example because of channel errors) is used in some related arts as well.

The operation of the “local” decoder (533) can be the same as of a “remote” decoder, such as the video decoder (410), which has already been described in detail above in conjunction with FIG. 4. Briefly referring also to FIG. 4, however, as symbols are available and encoding/decoding of symbols to a coded video sequence by an entropy coder (545) and the parser (420) can be lossless, the entropy decoding parts of the video decoder (410), including the buffer memory (415), and parser (420) may not be fully implemented in the local decoder (533).

An observation that can be made at this point is that any decoder technology except the parsing/entropy decoding that is present in a decoder also necessarily needs to be present, in substantially identical functional form, in a corresponding encoder. For this reason, the disclosed subject matter focuses on decoder operation. The description of encoder technologies can be abbreviated as they are the inverse of the comprehensively described decoder technologies. Only in certain areas a more detail description is required and provided below.

During operation, in some examples, the source coder (530) may perform motion compensated predictive coding, which codes an input picture predictively with reference to one or more previously-coded picture from the video sequence that were designated as “reference pictures”. In this manner, the coding engine (532) codes differences between pixel blocks of an input picture and pixel blocks of reference picture(s) that may be selected as prediction reference(s) to the input picture.

The local video decoder (533) may decode coded video data of pictures that may be designated as reference pictures, based on symbols created by the source coder (530). Operations of the coding engine (532) may advantageously be lossy processes. When the coded video data may be decoded at a video decoder (not shown in FIG. 5), the reconstructed video sequence typically may be a replica of the source video sequence with some errors. The local video decoder (533) replicates decoding processes that may be performed by the video decoder on reference pictures and may cause reconstructed reference pictures to be stored in the reference picture cache (534). In this manner, the video encoder (503) may store copies of reconstructed reference pictures locally that have common content as the reconstructed reference pictures that will be obtained by a far-end video decoder (absent transmission errors).

The predictor (535) may perform prediction searches for the coding engine (532). That is, for a new picture to be coded, the predictor (535) may search the reference picture memory (534) for sample data (as candidate reference pixel blocks) or certain metadata such as reference picture motion vectors, block shapes, and so on, that may serve as an appropriate prediction reference for the new pictures. The predictor (535) may operate on a sample block-by-pixel block basis to find appropriate prediction references. In some cases, as determined by search results obtained by the predictor (535), an input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (534).

The controller (550) may manage coding operations of the source coder (530), including, for example, setting of parameters and subgroup parameters used for encoding the video data.

Output of all aforementioned functional units may be subjected to entropy coding in the entropy coder (545). The entropy coder (545) translates the symbols as generated by the various functional units into a coded video sequence, by lossless compressing the symbols according to technologies such as Huffman coding, variable length coding, arithmetic coding, and so forth.

The transmitter (540) may buffer the coded video sequence(s) as created by the entropy coder (545) to prepare for transmission via a communication channel (560), which may be a hardware/software link to a storage device which would store the encoded video data. The transmitter (540) may merge coded video data from the video coder (503) with other data to be transmitted, for example, coded audio data and/or ancillary data streams (sources not shown).

The controller (550) may manage operation of the video encoder (503). During coding, the controller (550) may assign to each coded picture a certain coded picture type, which may affect the coding techniques that may be applied to the respective picture. For example, pictures often may be assigned as one of the following picture types:

An Intra Picture (I picture) may be one that may be coded and decoded without using any other picture in the sequence as a source of prediction. Some video codecs allow for different types of intra pictures, including, for example Independent Decoder Refresh (“IDR”) Pictures. A person skilled in the art is aware of those variants of I pictures and their respective applications and features.

A predictive picture (P picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most one motion vector and reference index to predict the sample values of each block.

A bi-directionally predictive picture (B Picture) may be one that may be coded and decoded using intra prediction or inter prediction using at most two motion vectors and reference indices to predict the sample values of each block. Similarly, multiple-predictive pictures can use more than two reference pictures and associated metadata for the reconstruction of a single block.

Source pictures commonly may be subdivided spatially into a plurality of sample blocks (for example, blocks of 4×4, 8×8, 4×8, or 16×16 samples each) and coded on a block-by-block basis. Blocks may be coded predictively with reference to other (already coded) blocks as determined by the coding assignment applied to the blocks' respective pictures. For example, blocks of I pictures may be coded non-predictively or they may be coded predictively with reference to already coded blocks of the same picture (spatial prediction or intra prediction). Pixel blocks of P pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of B pictures may be coded predictively, via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.

The video encoder (503) may perform coding operations according to a predetermined video coding technology or standard, such as ITU-T Rec. H.265. In its operation, the video encoder (503) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancies in the input video sequence. The coded video data, therefore, may conform to a syntax specified by the video coding technology or standard being used.

In an embodiment, the transmitter (540) may transmit additional data with the encoded video. The source coder (530) may include such data as part of the coded video sequence. Additional data may comprise temporal/spatial/SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, and so on.

A video may be captured as a plurality of source pictures (video pictures) in a temporal sequence. Intra-picture prediction (often abbreviated to intra prediction) makes use of spatial correlation in a given picture, and inter-picture prediction makes uses of the (temporal or other) correlation between the pictures. In an example, a specific picture under encoding/decoding, which is referred to as a current picture, is partitioned into blocks. When a block in the current picture is similar to a reference block in a previously coded and still buffered reference picture in the video, the block in the current picture can be coded by a vector that is referred to as a motion vector. The motion vector points to the reference block in the reference picture, and can have a third dimension identifying the reference picture, in case multiple reference pictures are in use.

In some embodiments, a bi-prediction technique can be used in the inter-picture prediction. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture that are both prior in decoding order to the current picture in the video (but may be in the past and future, respectively, in display order) are used. A block in the current picture can be coded by a first motion vector that points to a first reference block in the first reference picture, and a second motion vector that points to a second reference block in the second reference picture. The block can be predicted by a combination of the first reference block and the second reference block.

Further, a merge mode technique can be used in the inter-picture prediction to improve coding efficiency.

According to some embodiments of the disclosure, predictions, such as inter-picture predictions and intra-picture predictions are performed in the unit of blocks. For example, according to the HEVC standard, a picture in a sequence of video pictures is partitioned into coding tree units (CTU) for compression, the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one luma CTB and two chroma CTBs. Each CTU can be recursively quadtree split into one or multiple coding units (CUs). For example, a CTU of 64×64 pixels can be split into one CU of 64×64 pixels, or 4 CUs of 32×32 pixels, or 16 CUs of 16×16 pixels. In an example, each CU is analyzed to determine a prediction type for the CU, such as an inter prediction type or an intra prediction type. The CU is split into one or more prediction units (PUs) depending on the temporal and/or spatial predictability. Generally, each PU includes a luma prediction block (PB), and two chroma PBs. In an embodiment, a prediction operation in coding (encoding/decoding) is performed in the unit of a prediction block. Using a luma prediction block as an example of a prediction block, the prediction block includes a matrix of values (e.g., luma values) for pixels, such as 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, and the like.

FIG. 6 shows a diagram of a video encoder (603) according to another embodiment of the disclosure. The video encoder (603) is configured to receive a processing block (e.g., a prediction block) of sample values within a current video picture in a sequence of video pictures, and encode the processing block into a coded picture that is part of a coded video sequence. In an example, the video encoder (603) is used in the place of the video encoder (303) in the FIG. 3 example.

In an HEVC example, the video encoder (603) receives a matrix of sample values for a processing block, such as a prediction block of 8×8 samples, and the like. The video encoder (603) determines whether the processing block is best coded using intra mode, inter mode, or bi-prediction mode using, for example, rate-distortion optimization. When the processing block is to be coded in intra mode, the video encoder (603) may use an intra prediction technique to encode the processing block into the coded picture; and when the processing block is to be coded in inter mode or bi-prediction mode, the video encoder (603) may use an inter prediction or bi-prediction technique, respectively, to encode the processing block into the coded picture. In certain video coding technologies, merge mode can be an inter picture prediction submode where the motion vector is derived from one or more motion vector predictors without the benefit of a coded motion vector component outside the predictors. In certain other video coding technologies, a motion vector component applicable to the subject block may be present. In an example, the video encoder (603) includes other components, such as a mode decision module (not shown) to determine the mode of the processing blocks.

In the FIG. 6 example, the video encoder (603) includes the inter encoder (630), an intra encoder (622), a residue calculator (623), a switch (626), a residue encoder (624), a general controller (621), and an entropy encoder (625) coupled together as shown in FIG. 6.

The inter encoder (630) is configured to receive the samples of the current block (e.g., a processing block), compare the block to one or more reference blocks in reference pictures (e.g., blocks in previous pictures and later pictures), generate inter prediction information (e.g., description of redundant information according to inter encoding technique, motion vectors, merge mode information), and calculate inter prediction results (e.g., predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference pictures are decoded reference pictures that are decoded based on the encoded video information.

The intra encoder (622) is configured to receive the samples of the current block (e.g., a processing block), in some cases compare the block to blocks already coded in the same picture, generate quantized coefficients after transform, and in some cases also intra prediction information (e.g., an intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder (622) also calculates intra prediction results (e.g., predicted block) based on the intra prediction information and reference blocks in the same picture.

The general controller (621) is configured to determine general control data and control other components of the video encoder (603) based on the general control data. In an example, the general controller (621) determines the mode of the block, and provides a control signal to the switch (626) based on the mode. For example, when the mode is the intra mode, the general controller (621) controls the switch (626) to select the intra mode result for use by the residue calculator (623), and controls the entropy encoder (625) to select the intra prediction information and include the intra prediction information in the bitstream; and when the mode is the inter mode, the general controller (621) controls the switch (626) to select the inter prediction result for use by the residue calculator (623), and controls the entropy encoder (625) to select the inter prediction information and include the inter prediction information in the bitstream.

The residue calculator (623) is configured to calculate a difference (residue data) between the received block and prediction results selected from the intra encoder (622) or the inter encoder (630). The residue encoder (624) is configured to operate based on the residue data to encode the residue data to generate the transform coefficients. In an example, the residue encoder (624) is configured to convert the residue data from a spatial domain to a frequency domain, and generate the transform coefficients. The transform coefficients are then subject to quantization processing to obtain quantized transform coefficients. In various embodiments, the video encoder (603) also includes a residue decoder (628). The residue decoder (628) is configured to perform inverse-transform, and generate the decoded residue data. The decoded residue data can be suitably used by the intra encoder (622) and the inter encoder (630). For example, the inter encoder (630) can generate decoded blocks based on the decoded residue data and inter prediction information, and the intra encoder (622) can generate decoded blocks based on the decoded residue data and the intra prediction information. The decoded blocks are suitably processed to generate decoded pictures and the decoded pictures can be buffered in a memory circuit (not shown) and used as reference pictures in some examples.

The entropy encoder (625) is configured to format the bitstream to include the encoded block. The entropy encoder (625) is configured to include various information according to a suitable standard, such as the HEVC standard. In an example, the entropy encoder (625) is configured to include the general control data, the selected prediction information (e.g., intra prediction information or inter prediction information), the residue information, and other suitable information in the bitstream. Note that, according to the disclosed subject matter, when coding a block in the merge submode of either inter mode or bi-prediction mode, there is no residue information.

FIG. 7 shows a diagram of a video decoder (710) according to another embodiment of the disclosure. The video decoder (710) is configured to receive coded pictures that are part of a coded video sequence, and decode the coded pictures to generate reconstructed pictures. In an example, the video decoder (710) is used in the place of the video decoder (310) in the FIG. 3 example.

In the FIG. 7 example, the video decoder (710) includes an entropy decoder (771), an inter decoder (780), a residue decoder (773), a reconstruction module (774), and an intra decoder (772) coupled together as shown in FIG. 7.

The entropy decoder (771) can be configured to reconstruct, from the coded picture, certain symbols that represent the syntax elements of which the coded picture is made up. Such symbols can include, for example, the mode in which a block is coded (such as, for example, intra mode, inter mode, bi-predicted mode, the latter two in merge submode or another submode), prediction information (such as, for example, intra prediction information or inter prediction information) that can identify certain sample or metadata that is used for prediction by the intra decoder (772) or the inter decoder (780), respectively, residual information in the form of, for example, quantized transform coefficients, and the like. In an example, when the prediction mode is inter or bi-predicted mode, the inter prediction information is provided to the inter decoder (780); and when the prediction type is the intra prediction type, the intra prediction information is provided to the intra decoder (772). The residual information can be subject to inverse quantization and is provided to the residue decoder (773).

The inter decoder (780) is configured to receive the inter prediction information, and generate inter prediction results based on the inter prediction information.

The intra decoder (772) is configured to receive the intra prediction information, and generate prediction results based on the intra prediction information.

The residue decoder (773) is configured to perform inverse quantization to extract de-quantized transform coefficients, and process the de-quantized transform coefficients to convert the residual from the frequency domain to the spatial domain. The residue decoder (773) may also require certain control information (to include the Quantizer Parameter (QP)), and that information may be provided by the entropy decoder (771) (data path not depicted as this may be low volume control information only).

The reconstruction module (774) is configured to combine, in the spatial domain, the residual as output by the residue decoder (773) and the prediction results (as output by the inter or intra prediction modules as the case may be) to form a reconstructed block, that may be part of the reconstructed picture, which in turn may be part of the reconstructed video. It is noted that other suitable operations, such as a deblocking operation and the like, can be performed to improve the visual quality.

It is noted that the video encoders (303), (503), and (603), and the video decoders (310), (410), and (710) can be implemented using any suitable technique. In an embodiment, the video encoders (303), (503), and (603), and the video decoders (310), (410), and (710) can be implemented using one or more integrated circuits. In another embodiment, the video encoders (303), (503), and (503), and the video decoders (310), (410), and (710) can be implemented using one or more processors that execute software instructions.

II. Inter Picture Prediction Modes

In various embodiments, a picture can be partitioned into blocks, for example, using a tree structure based partition scheme. The resulting blocks can then be processed according to different processing modes, such as an intra prediction mode, an inter prediction mode (e.g., merge mode, skip mode, advanced motion vector prediction (AVMP) mode), and the like. An intra coded block can be a block that is coded with an intra prediction mode. In contrast, an inter coded block can be a bock that is processed with an inter prediction mode.

1. Regular Merge Mode

When a currently processed block, referred to as a current block, is processed according to the merge mode, a merge candidate list for the current block can be constructed according to a set of spatially and/or temporally neighboring block. One of the motion information candidates in the merge candidate list can be selected for determining or deriving the motion information for the current block. A merge index indicating which candidate is selected can be signaled from an encoder to a decoder.

FIG. 8 is a schematic illustration of a current block and corresponding merge candidates according to a merge mode in accordance with an embodiment. In this example, a merge candidate list is to be constructed for a current block (810) that is to be processed according to the merge mode. A set of neighboring blocks, denoted A1, B1, B0, A0, B2, C0, and C1 are defined for the merge mode processing. Spatial candidates for constructing the merge candidate list can be determined according to spatially neighboring blocks A1, B1, B0, A0, and B2 that are in the same picture as the current block (810). Also, temporal candidates for constructing the merge candidate list can be determined according to temporal neighboring blocks C0 and C1, which correspond to blocks that are in another coded picture and neighbor or overlap a co-located block of the current block (810). In one example, the temporal neighboring block C1 can be located at a position corresponding to a position near (e.g., adjacent to) a center of the current block (810).

In some examples, the merge candidate list can have a predefined maximum number of merge candidates, represented as Cm. The merge candidates can be listed in the merge candidate list according to a certain order. In one example, according to a predefined order, a first number of merge candidates, Ca, can be derived from the spatially neighboring blocks according to the order {A1, B1, B0, A0, B2}, and a second number of merge candidates, Cb=Cm−Ca, can be derived from the temporally neighboring blocks according to the order {C0, C1}.

In some scenarios, candidate motion information from a particular neighboring block may be unavailable. For example, a neighboring block can be intra-predicted, outside of a slice or tile including the current block (810), or not in a same coding tree block (CTB) row as the current block (810). In some scenarios, candidate motion information from various neighboring blocks may be redundant. In some examples, the redundant merge candidate can be removed from the merge candidate list (e.g., by performing a pruning process). When a total number of available merge candidates (with redundant candidates being removed) in the merge candidate list is smaller than the maximum number of merge candidates Cm, one or more additional merge candidates can be added (e.g., according to a preconfigured rule) to fill the merge candidate list. For example, additional merge candidates can include combined bi-predictive candidates and/or zero motion vector candidates.

After the merge candidate list is constructed, at an encoder, an evaluation process can be performed to select a merge candidate from the merge candidate list. For example, rate-distortion (RD) performance corresponding to each merge candidate can be calculated, and the one with the best RD performance can be selected. Accordingly, a merge index associated with the selected merge candidate can be determined for the current block (810) and signaled to a decoder.

At a decoder, the merge index of the current block (810) can be received. A similar merge candidate list construction process, as described above, can be performed to generate a merge candidate list that is the same as the merge candidate list generated at the encoder side. After the merge candidate list is constructed, a merge candidate can be selected from the merge candidate list based on the received merge index without performing any further evaluations in some examples. Motion information of the selected merge candidate can be used for a subsequent motion-compensated prediction of the current block (810).

A skip mode is also introduced in some examples. For example, in the skip mode, a current block can be predicted using a merge mode as described above to determine a set of motion information, without introducing residue information. A skip flag can be associated with the current block. The skip flag and a merge index indicating the related motion information of the current block can be signaled to a video decoder. For example, at the beginning of a CU in an inter-picture prediction slice, a skip flag can be signaled that implies the following: the CU only contains one PU (2N×2N); the merge mode is used to derive the motion information; and no residual information is present in the bitstream. At the decoder side, based on the skip flag, a prediction block can be determined based on the merge index for decoding a respective current block without adding residue information. Thus, various methods for video coding with merge mode disclosed herein can be utilized in combination with a skip mode.

In some embodiments, a merge flag or a skip flag that is signaled in a bitstream can indicate whether the current block (810) is to be coded according to the merge mode. If the merge flag is set to be TRUE, a merge index can then be signaled to indicate which candidate in a merge candidate list will be used to provide motion information for the current block. In some embodiments, up to four spatial merge candidates (from four spatially neighboring blocks) and up to one temporal merge candidate (from one temporally neighboring block) can be added to the merge candidate list. A syntax MaxMergeCandsNum can be defined to indicate the size of the merge candidate list. The syntax MaxMergeVandsNum can be signaled in the bitstream.

2. Affine Merge Mode

FIG. 9 is a schematic illustration of spatial neighboring blocks and a temporal neighboring block of a current block (or referred to as a coding unit (CU)) (901) in accordance with an embodiment. As shown, the spatially neighboring blocks are denoted A0, A1, A2, B0, B1, B2, and B3 (902, 903, 907, 904, 905, 906, and 908, respectively), and the temporally neighboring block is denoted C0 (912). In some examples, the spatially neighboring blocks A0, A1, A2, B0, B1, B2, and B3 and the current block (901) are in a same picture. In some examples, the temporally neighboring block C0 is in a reference picture and corresponds to a position outside the current block (901) and adjacent to a lower-right corner of the current block (901).

In some examples, a motion vector of the current block (901) and/or sub-blocks of the current block can be derived using an affine model (e.g., a 6-parameter affine model or a 4-parameter affine model). In some examples, an affine model has 6 parameters (e.g., a 6-parameter affine model) to describe the motion vector of a block or a sub-block. In an example, the 6 parameters of an affine coded block can be represented by three motion vectors (also referred to as three control point motion vectors (CPMVs) at three different locations of the block (e.g., control points CP0, CP1, and CP2 at upper-left, upper-right, and lower-left corners in FIG. 9). In another example, a simplified affine model uses four parameters to describe the motion information of an affine coded block, which can be represented by two motion vectors (also referred to as two CPMVs) at two different locations of the block (e.g., control points CP0 and CP1 at upper-left and upper-right corners in FIG. 9).

A list of motion information candidates (also referred to as an affine merge candidate list) can be constructed using an affine merge mode based on motion information of one or more of the spatial neighboring blocks and/or temporal neighboring blocks. In some examples, the affine merge mode can be applied when the current block (901) has a width and height that are equal to or greater than 8 samples. According to the affine merge mode, the CPMVs of the current block (901) can be determined based on the motion information candidates on the list. In some examples, the list of motion information candidates can include up to five CPMV candidates, and an index can be signaled to indicate which CPMV candidate is to be used for the current block. In some embodiments, a CPMV candidate includes all the CPMVs for an affine model.

In some embodiments, the affine merge candidate list can have three types of CPVM candidates, including inherited affine candidates, constructed affine candidates, and a zero MV. An inherited affine candidate can be derived by extrapolation from the CPMVs of the neighboring blocks. A constructed affine candidate can be derived using the translational MVs of the neighboring blocks.

In an example, there can be at most two inherited affine candidates, which are derived from corresponding affine motion models of the neighboring blocks, including one block from left neighboring blocks (A0 and A1) and one from upper neighboring blocks (B0, B1, and B2). For the candidate from the left, neighboring blocks A0 and A1 can be sequentially checked, and a first available inherited affine candidate from neighboring blocks A0 and A1 is used as the inherited affine candidate from the left. For the candidate from the top, neighboring blocks B0, B1, and B2 can be sequentially checked, and a first available inherited affine candidate from neighboring blocks B0, B1, and B2 is used as the inherited affine candidate from the top. In some examples, no pruning check is performed between the two inherited affine candidates.

When a neighboring affine block is identified, a corresponding inherited affine candidate to be added to the affine merge list of the current block (901) can be derived from the control point motion vectors of the neighboring affine block. In the FIG. 9 example, if the neighboring block A1 is coded in affine mode, the motion vectors of the upper-left corner (control point CPO_(A1)), the upper-right corner (control point CP1 _(A1)), and the lower-left corner (control point CP2 _(A1)) of block A1 can be obtained. When block A1 is coded using a 4-parameter affine model, the two CPMVs as an inherited affine candidate of the current block (901) can be calculated according to the motion vectors of control point CPO_(A1) and control point CP1 _(A1). When block A1 is coded using a 6-parameter affine model, the three CPMVs as an inherited affine candidate of the current block (901) can be calculated according to the motion vectors of control point CPO_(A1), control point CP1 _(A1), and control point CP2 _(A1).

Moreover, a constructed affine candidate can be derived by combining the neighboring translational motion information of each control point. The motion information for the control points CP0, CP1, and CP2 is derived from the specified spatial neighboring blocks A0, A1, A2, B0, B1, B2, and B3.

For example, CPMV_(k) (k=1, 2, 3, 4) represents the motion vector of the k-th control point, where CPMV₁ corresponds to control point CP0, CPMV₂ corresponds to control point CP1, CPMV₃ corresponds to control point CP2, and CPMV₄ corresponds to a temporal control point based on temporal neighboring block C0. For CPMV₁, neighboring blocks B2, B3, and A2 can be sequentially checked, and a first available motion vector from neighboring blocks B2, B3, and A2 is used as CPMV₁. For CPMV₂, neighboring blocks B1 and B0 can be sequentially checked, and a first available motion vector from neighboring blocks B1 and B0 is used as CPMV₂. For CPMV₃, neighboring blocks A1 and A0 can be sequentially checked, and a first available motion vector from neighboring blocks A1 and A0 is used as CPMV₃. Moreover, the motion vector of temporal neighboring block C0 can be used as CPMV₄, if available.

After CPMV₁, CPMV₂, CPMV₃, and CPMV₄, of four control points CP0, CP1, CP2 and the temporal control point are obtained, an affine merge candidate list can be constructed to include affine merge candidates that are constructed in an order of: {CPMV₁, CPMV₂, CPMV₃}, {CPMV₁, CPMV₂, CPMV₄}, {CPMV₁, CPMV₃, CPMV₄}, {CPMV₂, CPMV₃, CPMV₄}, {CPMV₁, CPMV₂}, and {CPMV₁, CPMV₃}. Any combination of three CPMVs can form a 6-parameter affine merge candidate, and any combination of two CPMVs can form a 4-parameter affine merge candidate. In some examples, in order to avoid a motion scaling process, if the reference indices of a group of control points are different, the corresponding combination of CPMVs can be discarded.

3. Subblock-Based Temporal Motion Vector Prediction (SbTMVP) Mode

FIG. 10A is a schematic illustration of spatial neighboring blocks that can be used to determine predicted motion information for a current block (1011) using a subblock-based temporal motion vector prediction (SbTMVP) method in accordance with one embodiment. FIG. 10A shows a current block (1011) and its spatial neighboring blocks denoted A0, A1, B0, and B1 (1012, 1013, 1014, and 1015, respectively). In some examples, spatial neighboring blocks A0, A1, B0, and B1 and the current block (1011) are in a same picture.

FIG. 10B is a schematic illustration for determining motion information for sub-blocks of the current block (1011) using the SbTMVP method based on a selected spatial neighboring block, such as block A1 in this non-limiting example, in accordance with an embodiment. In this example, the current block (1011) is in a current picture (1010), and a reference block (1061) is in a reference picture (1060) and can be identified based on a motion shift (or displacement) between the current block (1011) and the reference block (1061) indicated by a motion vector (1022).

In some embodiments, similar to a temporal motion vector prediction (TMVP) in HEVC, a SbTMVP uses the motion information in various reference sub-blocks in a reference picture for a current block in a current picture. In some embodiments, the same reference picture used by TMVP can be used for SbTVMP. In some embodiments, TMVP predicts motion information at a CU level but SbTMVP predicts motion at a sub-CU level. In some embodiments, TMVP uses the temporal motion vectors from a collocated block in the reference picture, which has a corresponding position adjacent to a lower-right corner or a center of a current block, and SbTMVP uses the temporal motion vectors from a reference block, which can be identified by performing a motion shift based on a motion vector from one of the spatial neighboring blocks of the current block.

For example, as shown in FIG. 10A, neighboring blocks A1, B1, B0, and A0 can be sequentially checked in a SbTVMP process. As soon as a first spatial neighboring block that has a motion vector that uses the reference picture (1060) as its reference picture is identified, such as block A1 having the motion vector (1022) that points to a reference block AR1 in the reference picture (1060) for example, this motion vector (1022) can be used for performing the motion shift. If no such motion vector is available from the spatial neighboring blocks A1, B1, B0, and A0, the motion shift is set to (0, 0).

After determining the motion shift, the reference block (1061) can be identified based on a position of the current block (1011) and the determined motion shift. In FIG. 10B, the reference block (1061) can be further divided into 16 sub-blocks with reference motion information MRa through MRp. In some examples, the reference motion information for each sub-block in the reference block (1061) can be determined based on a smallest motion grid that covers a center sample of the respective sub-block. The motion information can include motion vectors and corresponding reference indices. The current block (1011) can be further divided into 16 sub-blocks, and the motion information MVa through MVp for the sub-blocks in the current block (1011) can be derived from the reference motion information MRa through MRp in a manner similar to the TMVP process, with temporal scaling in some examples.

The sub-block size used in the SbTMVP process can be fixed (or otherwise predetermined) or signaled. In some examples, the sub-block size used in the SbTMVP process can be 8×8 samples. In some examples, the SbTMVP process is only applicable to a block with a width and height equal to or greater than the fixed or signaled size, for example 8 pixels.

In an example, a combined sub-block based merge list which contains a SbTVMP candidate and affine merge candidates is used for the signaling of a sub-block based merge mode. The SbTVMP mode can be enabled or disabled by a sequence parameter set (SPS) flag. In some examples, if the SbTMVP mode is enabled, the SbTMVP candidate is added as the first entry of the list of sub-block based merge candidates, and followed by the affine merge candidates. In some embodiments, the maximum allowed size of the sub-block based merge list is set to five. However, other sizes may be utilized in other embodiments.

In some embodiments, the encoding logic of the additional SbTMVP merge candidate is the same as for the other merge candidates. That is, for each block in a P or B slice, an additional rate-distortion check can be performed to determine whether to use the SbTMVP candidate.

4. History-Based Motion Vector Prediction (HMVP) Mode

FIG. 11A is a flow chart outlining a process (1100) of constructing and updating a list of motion information candidates using a history-based MV prediction (HMVP) method in accordance with one embodiment.

In some embodiments, a list of motion information candidates using the HMVP method can be constructed and updated during an encoding or decoding process. The list can be referred to as a history list. The history list can be stored in forms of an HMVP table or an HMVP buffer. The history list can be emptied when a new coding partition, such as a new slice, begins. In some embodiments, whenever there is an inter-coded non-affine block that is just encoded or decoded, the associated motion information can be added to a last entry of the history list as a new HMVP candidate. Therefore, before processing (encoding or decoding) a current block, the history list with HMVP candidates can be loaded (S1112). The current block can be encoded or decoded using the HMVP candidates in the history list (S1114). Afterwards, the history list can be updated using the motion information for encoding or decoding the current block (S1116).

FIG. 11B is a schematic illustration of updating the list of motion information candidates using the history-based MV prediction method in accordance with one embodiment. FIG. 11B shows a history list having a size of L, where each candidate in the list can be identified with an index ranging from 0 to L−1. L is an integer equal to or greater than 0. Before encoding or decoding a current block, the history list (1120) includes L candidates HMVP₀, HMVP₁, HMVP₂, . . . HMVP_(m), . . . , HMVP_(L-2), and HMVP_(L-1), where m is an integer ranging from 0 to L−1. After encoding or decoding a current block, a new entry HMVP_(C) is to be added to the history list.

In an example, the size of the history list can be set to 6, which indicates up to 6 HMVP candidates can be added to the history list. When inserting a new motion candidate (e.g., HMVP_(C)) to the history list, a constrained first-in-first-out (FIFO) rule can be utilized, wherein a redundancy check is first applied to find whether there is a redundant HMVP candidate in the history list. When no redundant HMVP candidate is found, the first HMVP candidate (HMVP₁ in FIG. 11B example, with index=0) is removed from the list, and all other HMVP candidates afterwards are moved forward, e.g., with indices reduced by 1. For example, HMVP_(m+1) is moved up to be associated with index=m. The new HMVP_(C) candidate can be added to the last entry of the list (with index=L−1 in FIG. 11B for example), as shown in the resulting list (1130). On the other hand, if a redundant HMVP candidate is found (such as HMVP₂ in FIG. 11B example), the redundant HMVP candidate in the history list is removed from the list, and all the HMVP candidates afterwards are moved forward, e.g., with indices reduced by 1. The new HMVP_(C) candidate can be added to the last entry of the list (with index=L−1 in FIG. 11B for example), as shown in the resulting list (1140).

In some examples, the HMVP candidates could be used in the merge candidate list construction process. For example, the latest HMVP candidates in the list can be checked in order and inserted into the candidate list after a TMVP candidate. Pruning can be applied on the HMVP candidates against the spatial or temporal merge candidates, but not the sub-block motion candidates (e.g., SbTMVP candidates) in some embodiments.

In some embodiments, to reduce the number of pruning operations, one or more of the following rules can be followed:

-   -   (a) Number of HMPV candidates to be checked denoted by M is set         as follows:

M=(N<=4)?L:(8−N),

-   -   wherein N indicates a number of available non-sub block merge         candidates, and L indicates number of available HMVP candidates         in the history list.     -   (b) In addition, once the total number of available merge         candidates becomes only one less than a signaled maximum number         of merge candidates, the merge candidate list construction         process from HMVP list can be terminated.     -   (c) Moreover, the number of pairs for combined bi-predictive         merge candidate derivation can be reduced from 12 to 6.

In some embodiments, HMVP candidates can be used in an AMVP candidate list construction process. The motion vectors of the last K HMVP candidates in the history list can be added to an AMVP candidate list after a TMVP candidate. In some examples, only HMVP candidates with the same reference picture as an AMVP target reference picture are to be added to the AMVP candidate list. Pruning can be applied on the HMVP candidates. In some examples, K is set to 4 while the AMVP list size is kept unchanged, e.g., equal to 2.

5. Pairwise Average Motion Vector Candidates

In some embodiments, pairwise average candidates can be generated by averaging predefined pairs of candidates in a current merge candidate list. For example, the predefined pairs are defined as {(0, 1), (0, 2), (1, 2), (0, 3), (1, 3), (2, 3)} in an embodiment, where the numbers denote the merge indices to the merge candidate list. For example, the averaged motion vectors are calculated separately for each reference picture list. If both to-be-averaged motion vectors are available in one list, these two motion vectors are averaged even when they point to different reference pictures. If only one motion vector is available, the available one can be used directly. If no motion vector is available, the respective pair is skipped in one example. The pairwise average candidates replace the combined candidates in some embodiments in constructing a merge candidate list.

6. Merge with Motion Vector Difference (MMVD) Mode

In some embodiments, a merge with motion vector difference (MMVD) mode is used for determining a motion vector predictor of a current block. The MMVD mode can be used when skip mode or merge mode is enabled. The MMVD mode reuses merge candidates on a merge candidate list of the skip mode or merge mode. For example, a merge candidate selected from the merge candidate list can be used to provide a starting point at a reference picture. A motion vector of the current block can be expressed with the starting point and a motion offset including a motion magnitude and a motion direction with respect to the starting point. At an encoder side, selection of the merge candidate and determination of the motion offset can be based on a search process (an evaluation process). At a decoder side, the selected merge candidate and the motion offset can be determined based on signaling from the encoder side.

The MMVD mode can reuse a merge candidate list constructed in various inter prediction modes described herein. In some examples, only candidates of a default merge type (e.g., MRG_TYPE_DEFAULT_N) on the merge candidate list are considered for MMVD mode. Examples of the merge candidates of the default merge types can include (i) merge candidates employed in the merge mode, (ii) merge candidates from a history buffer in the HMVP mode, and (iii) pairwise average motion vector candidates as described herein. Merge candidates in the affine mode or SbTMVP mode are not used for expansion in MMVD mode in some examples.

A base candidate index (IDX) can be used to define the starting point. For example, a list of merge candidates (motion vector predicators (MVPs)) associated with indices from 0 to 3 is shown in Table 1. The merge candidate having an index of the base candidate index can be determined from the list, and used to provide the starting point.

TABLE 1 Base candidate IDX Base candidate IDX 0 1 2 3 N^(th) MVP 1^(st) MVP 2^(nd) MVP 3^(rd) MVP 4^(th) MVP

A distance index can be used to provide motion magnitude information. For example, a plurality of predefined pixel distances are shown in Table 2 each associated with indices from 0 to 7. The pixel distance having an index of the distance index can be determined from the plurality of pixel distances, and used to provide the motion magnitude.

TABLE 2 Distance IDX Distance IDX 0 1 2 3 4 5 6 7 Pixel ¼-pel ½-pel 1- 2- 4- 8- 16- 32- distance pel pel pel pel pel pel

A direction index can be used to provide motion direction information. For example, four directions with indices from 00 to 11 (binary) are shown in Table 3. The direction with an index of the direction index can be determined from the four directions, and used to provide a direction of the motion offset with respect to the starting point.

TABLE 3 Direction IDX Direction IDX 00 01 10 11 x-axis + − N/A N/A y-axis N/A N/A + −

MMVD syntax elements can be transmitted in a bitstream to signal a set of MMVD indices including a base candidate index, a direction index, and a distance IDX in the MMVD mode.

In some embodiments, an MMVD enable flag is signaled after sending a skip and merge flag for coding a current block. For example, when the skip and merge flag is true, the MMVD flag is parsed. When the MMVD flag is equal to 1, in an example, the MMVD syntax elements (the set of MMVD indices) are parsed. In one example, when the MMVD flag is not 1, a flag associated with another mode, such as an AFFINE flag, is parsed. When the AFFINE flag is equal to 1, the AFFINE mode is used for processing the current block. When the AFFINE flag is not 1, in an example, a skip/merge index is parsed for processing the current block with skip/merge mode.

FIGS. 12-13 show examples of a search process and search point in MMVD mode according to an embodiment of the disclosure. By performing the search process, a set of MMVD indices including a base candidate index, a direction index, and a distance index can be determined for a current block (1212) in a current picture (or referred to as a current frame, 1210).

As shown in FIGS. 12-13, a first motion vector (1222) and a second motion vector (1224) specified in a first merge candidate are shown. The first merge candidate can be a merge candidate on a merge candidate list constructed for the current block (1212). The first and second motion vectors (1222) and (1224) can be associated with two reference pictures (1240) and (1260) in reference picture lists L0 and L1, respectively. Accordingly, two starting points (1241) and (1261) in FIG. 13 can be determined at the reference pictures (1240) and (1260).

In an example, based on the starting points (1241) and (1261), multiple predefined points extending from the starting points (1241) and (1261) in vertical directions (represented by +Y, or −Y) or horizontal directions (represented by +X and −X) in the reference pictures (1240) and (1260) can be evaluated. In one example, a pair of points mirroring each other with respect to the respective starting point (1312) or (1314), such as the pair of points (1322) and (1324), or the pair of points (1241) and (1261), can be used to determine a pair of motion vectors which may form a motion vector predictor candidate for the current block (1212). Those motion vector predictor candidates determined based on the predefined points surrounding the starting points (1241) or (1261) can be evaluated.

In addition to the first merge candidate, other available or valid merge candidates in the merge candidate list of the current block (1212) can also be evaluated similarly. In one example, for a uni-predicted merge candidate, only one prediction direction associated with one of the two reference picture lists is evaluated.

Based on the evaluations, a motion vector predictor candidate can be determined. Accordingly, corresponding to the motion vector predictor candidate, a merge candidate can be selected from the merge list, and a motion direction and a motion distance can also be determined. For example, based on the selected merge candidate and the Table 1, a base candidate index can be determined. Based on the selected motion vector predictor, such as that corresponding to the predefined point (1314) (or (1322)), a direction and a distance of the point (1314) with respect to the starting point (1241) can be determined. According to Table 2 and Table 3, a direction index and a distance index can accordingly be determined.

It is noted that the examples described above are merely for illustrative purposes. In alternative examples, based on the motion vector expression method provided in the MMVD mode, the motion distances and motion directions may be defined differently. In addition, the evaluation process (search process) may be performed differently. For example, for a bi-prediction merge candidate, three types of prediction directions (e.g., L0, L1, and L0 and L1) may be evaluated based on a set of predefined distances and directions to select a motion vector predictor. For another example, a uni-predicted merge candidate may be converted by mirroring or scaling to a bi-predicted merge candidate, and subsequently evaluated. In the above examples, an additional syntax indicating a prediction direction (e.g., L0, L1, or L0 and L1) resulting from the evaluation process may be signaled.

As described above, merge candidates on a merge candidate list are evaluated to determine a base candidate in the MMVD mode at an encoder. At a decoder, using a base candidate index as input, a motion vector predictor can be selected from a merge candidate list. Accordingly, no additional line buffer is needed for the MMVD mode in addition to a line buffer for storage of the merge candidates.

7. Merge Sharing Region with a Shared Merge List

In some embodiments, a merge sharing region with a shared merge list is employed when a size of a current block and/or sizes of sub-blocks within the current block meet certain conditions. For example, leaf CUs of a particular node (e.g., ancestor node) in a CU split tree can share a merge candidate list. In this way, separate construction of a merge candidate list for each of the leaf CUs can be avoided, which enables parallel processing of small merge/skip-coded CUs within a merge sharing region. The particular node can be referred to as a merge sharing node that corresponds to a merge sharing region. The shared merge candidate list is generated for the merge sharing node as if the merge sharing node is a leaf CU.

Whether a split-tree node can be treated as a merge sharing node can be decided for each node inside a CTU during a parsing stage of decoding. In an example, an ancestor node of leaf CUs can be determined to be a merge sharing node when the ancestor node satisfies the following criteria:

-   -   (a) The block size of the ancestor node is equal to or larger         than a size threshold (e.g., 32 pixels, 64 pixels, or the like);         and     -   (b) Within the ancestor node, one of the child CU has a size         smaller than the size threshold.

FIG. 14A shows examples of merge sharing regions (1410), (1420), (1430), and (1440) defined based on a size threshold of 64 pixels. Each of the merge sharing regions (1410)-(1440) has a block size of 64 pixels equal to the size threshold. Each of the merge sharing regions (1410)-(1440) includes at least one leaf CU having a size smaller than the size threshold.

FIG. 14B shows another example of a merge sharing region (1450) defined based on a size threshold of 64 pixels. The merge sharing region (1450) includes three sub-blocks (1452), (1454), and (1456) having sizes of 32, 64, and 32 pixels, respectively. The merge sharing region (1450) has a size of 128 pixels that is larger than the size threshold, and includes two sub-blocks (1452) and (1456) that have a size smaller than the size threshold.

In other examples, determination of a merge sharing region can be based on a different definition. For example, an ancestor node of leaf CUs having a block size smaller than a threshold can be determined to be a merge sharing region. Using FIG. 14B as an example, when a threshold of 64 pixels is used, either of the blocks (1452)-(1456) can be determined to be a separate merge sharing region.

The threshold of 64 pixels is merely introduced as a non-limiting example. In other embodiments, the threshold can be set to 32 pixels or other suitable values.

In addition, in some examples, no samples of the merge sharing node are outside the picture boundary. During a parsing stage, if an ancestor node satisfies a definition of a merge sharing region, but has some samples outside a picture boundary, this ancestor node will not be treated as a merge sharing node. Child CUs within this node may next be evaluated to determine a merge sharing region.

The shared merge candidate list algorithm can support translational merge/skip modes, such as regular merge mode, Intra Block Copying mode (or IBC mode), triangle partition mode, SbTMVP mode, MMVD mode, and the like. In some examples, affine merge mode is excluded for encoding blocks in a merge sharing region. Those merge/skip modes can be combined with an HMVP table when being used within a merge sharing region. For those merge/skip modes, the behavior of shared merge candidate list algorithm is similar to that based on a regular merge candidate list. In one aspect, the shared merge candidate list algorithm corresponds to generating candidates for a merge sharing node as if the merge sharing node is a leaf CU.

In some embodiments, the leaf CUs within a merge sharing region may be coded using coding modes other than a merge/skip mode. For example, a CU within a merge sharing node may be coded with an intra mode, or an inter mode other than the merge/skip mode (e.g., AMVP mode).

8. Triangular Prediction

A triangular prediction mode (TPM) can be employed for inter prediction in some embodiments. In an embodiment, the TPM is applied to CUs that are 8×8 samples or larger in size and are coded in skip or merge mode. In an embodiment, for a CU satisfying these conditions (8×8 samples or larger sizes and coded in skip or merge mode), a CU-level flag is signaled to indicate whether the TPM is applied or not.

FIG. 15A is a schematic illustration of two splitting examples for a current block according to a triangle prediction mode in accordance with one embodiment. When the TPM is used, in some embodiments, a CU is split evenly into two triangle-shaped partitions, along a diagonal from an upper-left corner to a lower-right corner (e.g., a diagonal split) or along a diagonal from an upper-right corner to a lower-left corner (e.g., an anti-diagonal split) as shown in FIG. 15A. In FIG. 15A, a current block (or also referred to as a CU) (1510A) can be split from an upper-left corner to a lower-right corner resulting in two triangular prediction units (1512) and (1514). The CU (1510B) can also be split from an upper-right corner to a lower-left corner resulting in two triangular prediction units (1516) and (1518). Each triangular prediction unit (1512), (1514), (1516), and (1518) in the two examples (1510A) and (1510B) can be inter-predicted using its own motion information.

In some embodiments, only uni-prediction is allowed for each triangular prediction unit. Accordingly, each triangular prediction unit has one motion vector and one reference picture index. The uni-prediction motion constraint can be applied to ensure that, similar to a conventional bi-prediction method, not more than two motion compensated predictions are performed for each CU. In this way, processing complexity can be reduced. The uni-prediction motion information for each triangular prediction unit can be derived from a uni-prediction merge candidate list. In some other embodiments, bi-prediction is allowed for each triangular prediction unit. Accordingly, the bi-prediction motion information for each triangular prediction unit can be derived from a bi-prediction merge candidate list.

In some embodiments, when a CU-level flag indicates that a current CU is coded using the TPM, an index, referred to as triangle partition index, is further signaled. For example, the triangle partition index can have a value in a range of [0, 39]. Using this triangle partition index, the direction of the triangle partition (diagonal or anti-diagonal), as well as the motion information for each of the partitions (e.g., merge indices (or referred to as TPM indices) to the respective uni-prediction candidate list) can be obtained through a look-up table at the decoder side.

After predicting each of the triangular prediction unit based on the obtained motion information, in an embodiment, the sample values along the diagonal or anti-diagonal edge of the current CU are adjusted by performing a blending process with adaptive weights. As a result of the blending process, a prediction signal for the whole CU can be obtained. Subsequently, a transform and quantization process can be applied to the whole CU in a way similar to other prediction modes. Finally, a motion field of a CU predicted using the triangle partition mode can be created, for example, by storing motion information in a set of 4×4 units partitioned from the CU. The motion field can be used, for example, in a subsequent motion vector prediction process to construct a merge candidate list.

8.1 Uni-Prediction Candidate List Construction

In some embodiments, a merge candidate list for prediction of two triangular prediction units of a coding block processed with a TPM can be constructed based on a set of spatial and temporal neighboring blocks of the coding block. Such a merge candidate list can be referred to as a TPM candidate list with TPM candidates listed herein. In one embodiment, the merge candidate list is a uni-prediction candidate list.

FIG. 15B shows an example of spatial and temporal neighboring blocks used to construct a uni-prediction candidate list for a triangular prediction mode in accordance with an embodiment. In some embodiments, the uni-prediction candidate list includes five uni-prediction motion vector candidates in an embodiment. For example, the five uni-prediction motion vector candidates are derived from seven neighboring blocks including five spatially neighboring blocks (denoted by S1 to S5 in FIG. 15B) and two temporally neighboring blocks (denoted by T6 and T7 in FIG. 15B).

In an example, the motion vectors of the seven neighboring blocks are collected and put into the uni-prediction candidate list according to the following order: first, the motion vectors of the uni-predicted neighboring blocks; (b) then, for the bi-predicted neighboring blocks, the L0 motion vectors (that is, the L0 motion vector part of the bi-prediction MV), the L1 motion vectors (that is, the L1 motion vector part of the bi-prediction MV), and averaged motion vectors of the L0 and L1 motion vectors of the bi-prediction MVs. In an example, if the number of candidates is less than five, zero motion vectors are added to the end of the list. In some other embodiments, the merge candidate list may include less than 5 or more than 5 uni-prediction or bi-prediction merge candidates that are selected from candidate positions that are the same or different from that shown in FIG. 15B.

8.2 Lookup Table and Table Indices

In an embodiment, a CU is coded with a triangular partition mode with a TPM (or merge) candidate list including five TPM candidates. Accordingly, there are 40 possible ways to predict the CU when 5 merge candidates are used for each triangular PU. In other words, there can be 40 different combinations of split directions and merge (or TPM) indices: 2 (possible split directions)×(5 (possible merge indices for a first triangular prediction unit)×5 (possible merge indices for a second triangular prediction unit)−5 (a number of possibilities when the pair of first and second prediction units shares a same merge index)). For example, when a same merge index is determined for the two triangular prediction units, the CU can be processed using a regular merge mode, instead of the triangular predication mode.

Accordingly, in an embodiment, a triangular partition index in the range of [0, 39] can be used to represent which one of the 40 combinations is used based on a lookup table as shown in Table 4 below.

TABLE 4 Look up table used to derive triangle direction and partition motions based on triangle index triangle_idx 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 triangle dir 0 1 1 0 0 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 Part 1 cand 1 0 0 0 2 0 0 1 3 4 0 1 1 0 0 1 1 1 1 2 Part 2 cand 0 1 2 1 0 3 4 0 0 0 2 2 2 4 3 3 4 4 3 1 triangle_idx 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 triangle dir 1 0 0 1 1 1 1 1 1 1 0 0 1 0 1 0 0 1 0 0 Part 1 cand 2 2 4 3 3 3 4 3 2 4 4 2 4 3 4 3 2 2 4 3 Part 2 cand 0 1 3 0 2 4 0 1 3 1 1 3 2 2 3 1 4 4 2 4

The first row (triangle_idx) of Table 4 indicates the triangular partition indices ranging from 0 to 39. The second row (triangle_dir) of Table 4 indicates possible split directions represented by 0 or 1. The third row (Part 1 cand) includes possible first merge indices corresponding to a first triangular prediction unit and ranging from 0 to 4. The fourth row (Part 2 cand) includes possible second merge indices corresponding to a second triangular prediction unit and ranging from 0 to 4.

For example, when a triangular partition index having a value of 1 is received at a decoder, based on a column of the lookup table corresponding to triangle_idx=1, it can be determined that the split direction is a partition direction represented by the value of 1 (e.g., the anti-diagonal split), and the first and second merge indices are 0 and 1, respectively. As the triangle partition indices are associated with a lookup table, a triangle partition index is also referred to as a table index in this disclosure.

8.3 Adaptive Blending Along the Triangular Partition Edge

In an embodiment, after predicting each triangular prediction unit using respective motion information, a blending process is applied to the two prediction signals of the two triangular prediction units to derive samples around the diagonal or anti-diagonal edge. The blending process adaptively chooses between two groups of weighting factors depending on the motion vector difference between the two triangular prediction units. In an embodiment, the two weighting factor groups are as follows:

-   -   (1) First weighting factor group: {7/8, 6/8, 4/8, 2/8, 1/8} for         samples of a luma component and {7/8, 4/8, 1/8} for samples of         chroma component; and     -   (2) Second weighting factor group: {7/8, 6/8, 5/8, 4/8, 3/8,         2/8, 1/8} for samples of a luma component and {6/8, 4/8, 2/8}         for samples of a chroma component.

The second weighting factor group has more luma weighting factors and blends more luma samples along the partition edge.

In an embodiment, the following condition is used to select one of the two weighting factor groups. When reference pictures of the two triangle partitions are different from each other, or when a motion vector difference between the two triangle partitions is greater than a threshold (e.g., 16 luma samples), the second weighting factor group can be selected. Otherwise, the first weighting factor group can be selected.

FIG. 16A shows an example of a coding unit applying the first set of weighting factors in an adaptive blending process in accordance with an embodiment. In FIG. 16A, a first coding block (1610) includes luma samples of a CU, and a second coding block (1620) includes chroma samples of the same CU. Each of the blocks is split into two triangular partitions P1, P2, P1′, and P2′. A set of pixels along a diagonal edge in the coding block (1610) or (1620) are labeled with the numbers 1, 2, 4, 6, and 7 corresponding to the weighting factors 1/8, 2/8, 4/8, 6/8, and 7/8, respectively, for partition P1 or partition P1′; and the weighting factors 7/8, 6/8, 4/8, 2/8, and 1/8, respectively, for partition P2 or partition P2′. For example, for a pixel labelled with the number of 2, a sample value of the pixel after a blending operation can be obtained according to:

the blended sample value=2/8×S1+6/8×S2,

where S1 and S2 represent sample values at the respective pixel but belonging to predictions of a first triangular prediction unit P1 and a second triangular prediction unit P2, respectively.

Moreover, the blank region without any weighting represents that the predicted samples according to the triangular partition P1 (or P1′) are adopted without merging. Similarly, the shaded region without any weighting represents that the predicted samples according to the triangular partition P2 are adopted without merging.

FIG. 16B shows an example of a coding unit applying a second set of weighting factors in an adaptive blending process in accordance with an embodiment. In FIG. 16B, a third coding block (1630) includes luma samples of a CU, and a fourth coding block (1640) includes chroma samples of the same CU. Each of the blocks is split into two triangular partitions P1, P2, P1′, and P2′. A set of pixels along a diagonal edge in the coding block (1630) or (1640) are labeled with the numbers 1, 2, 3, 4, 5, 6, and 7 corresponding to the weighting factors 1/8, 2/8, 3/8, 4/8, 5/8, 6/8, and 7/8, respectively, for partition P1 or partition P1′; and the weighting factors 7/8, 6/8, 5/8, 4/8, 3/8, 2/8, and 1/8, respectively, for partition P2 or partition P2′. Also, the blank region without any weighting represents that the predicted samples according to the triangular partition P1 (or P1′) are adopted without merging. Similarly, the shaded region without any weighting represents that the predicted samples according to the triangular partition P2 are adopted without merging.

III. Updating HMVP Buffer Using Sub-block Motion Information

In some embodiments, in addition to CUs coded according to regular inter prediction mode, CUs coded according to various subblock-based modes, for example the inter prediction modes as described above can also be used to update the HMVP buffer. The applicable subblock-based inter prediction modes may include Subblock-based TMVP mode, Affine inter mode, triangular inter prediction mode, or any other suitable subblock-based inter prediction modes.

In some embodiments, a current block can be divided into a plurality of sub-blocks. A plurality of pieces of sub-block motion information for the plurality of sub-blocks can be derived. Predicted sub-block samples for the sub-blocks can be generated according to the pieces of sub-block motion information. A predicted block for the current block can be generated according to a combination of the predicted sub-block samples. Moreover, a piece of the sub-block motion information from the pieces of sub-block motion information can be selected as representative motion information for the current block, and the representative motion information can be stored in an HMVP buffer in a manner as described with reference to FIG. 11B.

In some embodiments, the selected piece of sub-block motion information can be for a sub-block of the sub-blocks that is at a particular position in the current block. In one example, as shown in FIG. 17A, a coding unit (1710) that uses the piece of sub-block motion information for a sub-block (1714) is at a bottom-right position in the current block. In another example, as shown in FIG. 17B, a coding unit (1720) that uses the piece of sub-block motion information for a sub-block (1724) is at a center position in the current block. In some embodiments, the block at the center position is defined as the block that is adjacent to the center position, for example with an upper-left corner at the center position (1722) of the current block.

In some embodiments, a current block is coded according to affine inter prediction. In one example, the motion information of the sub-block that is located at the bottom-right position in the current block (as depicted in FIG. 17A) may be used to update the HMVP buffer. In one example, the motion information of the sub-block that is located at the center position in the current block (as depicted in FIG. 17B) may be used to update the HMVP buffer. In yet another example, the motion information of the sub-block that is located at another predefined position in the current block may be used to update the HMVP buffer.

In some embodiments, a current block is coded according to Subblock-based TMVP (SbTMVP) mode. In one example, the motion information of the sub-block that is located at the bottom-right position in the current block (as depicted in FIG. 17A) may be used to update the HMVP buffer. In one example, the motion information of the sub-block that is located at the center position in the current block (as depicted in FIG. 17B) may be used to update the HMVP buffer. In yet another example, the motion information of the sub-block that is located at another predefined position in the current block may be used to update the HMVP buffer.

In some embodiments, a current block is coded according to triangular inter prediction mode. In one example, the motion information for a region that corresponds to a sub-block that is located at the bottom-right position in the current block (as depicted in FIG. 17A) may be used to update the HMVP buffer. In one example, the motion information of the sub-block that is located at the center position in the current block (as depicted in FIG. 17B) may be used to update the HMVP buffer. In yet another example, the motion information for a region that corresponds to a sub-block that is located at another predefined position in the current block may be used to update the HMVP buffer.

In some embodiments, the particular position can be determined or signaled according to control information, for example, transmitted in a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), slice header, tile group header, or tile header.

FIG. 18 shows a flow chart outlining a process (1800) according to some embodiments of the disclosure. The process (1800) can be used in encoding or decoding a current block of a current picture, including updating a HMVP buffer according to motion information for coding the current block when the current block is coded according to a subblock-based inter prediction mode. In some embodiments, one or more operations are performed before or after process (1800), and some of the operations illustrated in FIG. 18 may be reordered or omitted.

In various embodiments, the process (1800) are executed by processing circuitry, such as the processing circuitry in the terminal devices (210), (220), (230) and (240), the processing circuitry that performs functions of the video decoder (310), the processing circuitry that performs functions of the video decoder (410), and the like. In some embodiments, the process (1800) is implemented in software instructions, thus when the processing circuitry executes the software instructions, the processing circuitry performs the process (1800). The process starts at (S1801) and proceeds to (S1810).

At (S1810), a current block is divided into a plurality of sub-blocks. The current block can be coded according to a subblock-based inter prediction mode, such as Subblock-based TMVP mode, Affine inter mode, triangular inter prediction mode, or the like. In some embodiments, each sub-block can have a size of 4×4 pixels or 8×8 pixels. In some embodiments, a sub-block can have a square shape or a rectangle shape, or any suitable shape.

At (S1820), a plurality of pieces of sub-block motion information for the plurality of sub-blocks can be derived according to the applicable subblock-based inter prediction mode as described with reference to FIGS. 9, 10, and 15A-16B for example.

At (S1830), predicted sub-block samples for the sub-blocks are generated according to the pieces of sub-block motion information.

At (S1840), a predicted block for the current block is generated according to a combination of the predicted sub-block samples from S1830.

At (S1850), a piece of the sub-block motion information from the pieces of sub-block motion information is selected as representative motion information for the current block. In some embodiments, the selected piece of sub-block motion information is for a sub-block of the sub-blocks that is at a particular position in the current block. In one example, the particular sub-block is at a bottom-right position in the current block. In another example, the particular sub-block is adjacent to a center position of the current block. In at least one example, an upper-left corner of the particular sub-block is at the center position of the current block.

In some embodiments, the particular position can be determined or signaled according to control information transmitted in a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), slice header, tile group header, or tile header.

At (S1860), the representative motion information is stored in an HMVP buffer. In some embodiments, the representative motion information can be stored in the HMVP buffer according to a process as described with reference to FIG. 11B.

After the representative motion information is stored in the HMVP buffer, the process 1800 may proceed to (S1899) and terminate.

The embodiments described herein may be used separately or combined in any order. Further, each of the embodiments, encoder, and decoder may be implemented by processing circuitry (e.g., one or more processors or one or more integrated circuits). In one example, the one or more processors execute a program that is stored in a non-transitory computer-readable medium.

IV. Computer System

The techniques described above, can be implemented as computer software using computer-readable instructions and physically stored in one or more computer-readable media. For example, FIG. 19 shows a computer system (1900) suitable for implementing certain embodiments of the disclosed subject matter.

The computer software can be coded using any suitable machine code or computer language, that may be subject to assembly, compilation, linking, or like mechanisms to create code comprising instructions that can be executed directly, or through interpretation, micro-code execution, and the like, by one or more computer central processing units (CPUs), Graphics Processing Units (GPUs), and the like.

The instructions can be executed on various types of computers or components thereof, including, for example, personal computers, tablet computers, servers, smartphones, gaming devices, internet of things devices, and the like.

The components shown in FIG. 19 for computer system (1900) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing embodiments of the present disclosure. Neither should the configuration of components be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary embodiment of a computer system (1900).

Computer system (1900) may include certain human interface input devices. Such a human interface input device may be responsive to input by one or more human users through, for example, tactile input (such as: keystrokes, swipes, data glove movements), audio input (such as: voice, clapping), visual input (such as: gestures), olfactory input (not depicted). The human interface devices can also be used to capture certain media not necessarily directly related to conscious input by a human, such as audio (such as: speech, music, ambient sound), images (such as: scanned images, photographic images obtain from a still image camera), video (such as two-dimensional video, three-dimensional video including stereoscopic video).

Input human interface devices may include one or more of (only one of each depicted): keyboard (1901), mouse (1902), trackpad (1903), touch screen (1910), data-glove (not shown), joystick (1905), microphone (1906), scanner (1907), camera (1908).

Computer system (1900) may also include certain human interface output devices. Such human interface output devices may be stimulating the senses of one or more human users through, for example, tactile output, sound, light, and smell/taste. Such human interface output devices may include tactile output devices (for example tactile feedback by the touch-screen (1910), data-glove (not shown), or joystick (1905), but there can also be tactile feedback devices that do not serve as input devices), audio output devices (such as: speakers (1909), headphones (not depicted)), visual output devices (such as screens (1910) to include CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch-screen input capability, each with or without tactile feedback capability—some of which may be capable to output two dimensional visual output or more than three dimensional output through means such as stereographic output; virtual-reality glasses (not depicted), holographic displays and smoke tanks (not depicted)), and printers (not depicted).

Computer system (1900) can also include human accessible storage devices and their associated media such as optical media including CD/DVD ROM/RW (1920) with CD/DVD or the like media (1921), thumb-drive (1922), removable hard drive or solid state drive (1923), legacy magnetic media such as tape and floppy disc (not depicted), specialized ROM/ASIC/PLD based devices such as security dongles (not depicted), and the like.

Those skilled in the art should also understand that term “computer readable media” as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.

Computer system (1900) can also include an interface to one or more communication networks. Networks can for example be wireless, wireline, optical. Networks can further be local, wide-area, metropolitan, vehicular and industrial, real-time, delay-tolerant, and so on. Examples of networks include local area networks such as Ethernet, wireless LANs, cellular networks to include GSM, 3G, 4G, 5G, LTE and the like, TV wireline or wireless wide area digital networks to include cable TV, satellite TV, and terrestrial broadcast TV, vehicular and industrial to include CANBus, and so forth. Certain networks commonly require external network interface adapters that attached to certain general purpose data ports or peripheral buses (1949) (such as, for example USB ports of the computer system (1900)); others are commonly integrated into the core of the computer system (1900) by attachment to a system bus as described below (for example Ethernet interface into a PC computer system or cellular network interface into a smartphone computer system). Using any of these networks, computer system (1900) can communicate with other entities. Such communication can be uni-directional, receive only (for example, broadcast TV), uni-directional send-only (for example CANbus to certain CANbus devices), or bi-directional, for example to other computer systems using local or wide area digital networks. Certain protocols and protocol stacks can be used on each of those networks and network interfaces as described above.

Aforementioned human interface devices, human-accessible storage devices, and network interfaces can be attached to a core (1940) of the computer system (1900).

The core (1940) can include one or more Central Processing Units (CPU) (1941), Graphics Processing Units (GPU) (1942), specialized programmable processing units in the form of Field Programmable Gate Areas (FPGA) (1943), hardware accelerators for certain tasks (1944), and so forth. These devices, along with Read-only memory (ROM) (1945), Random-access memory (1946), internal mass storage such as internal non-user accessible hard drives, SSDs, and the like (1947), may be connected through a system bus (1948). In some computer systems, the system bus (1948) can be accessible in the form of one or more physical plugs to enable extensions by additional CPUs, GPU, and the like. The peripheral devices can be attached either directly to the core's system bus (1948), or through a peripheral bus (1949). Architectures for a peripheral bus include PCI, USB, and the like.

CPUs (1941), GPUs (1942), FPGAs (1943), and accelerators (1944) can execute certain instructions that, in combination, can make up the aforementioned computer code. That computer code can be stored in ROM (1945) or RAM (1946). Transitional data can be also be stored in RAM (1946), whereas permanent data can be stored for example, in the internal mass storage (1947). Fast storage and retrieve to any of the memory devices can be enabled through the use of cache memory, that can be closely associated with one or more CPU (1941), GPU (1942), mass storage (1947), ROM (1945), RAM (1946), and the like.

The computer readable media can have computer code thereon for performing various computer-implemented operations. The media and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those having skill in the computer software arts.

As an example and not by way of limitation, the computer system having architecture (1900), and specifically the core (1940) can provide functionality as a result of processor(s) (including CPUs, GPUs, FPGA, accelerators, and the like) executing software embodied in one or more tangible, computer-readable media. Such computer-readable media can be media associated with user-accessible mass storage as introduced above, as well as certain storage of the core (1940) that are of non-transitory nature, such as core-internal mass storage (1947) or ROM (1945). The software implementing various embodiments of the present disclosure can be stored in such devices and executed by core (1940). A computer-readable medium can include one or more memory devices or chips, according to particular needs. The software can cause the core (1940) and specifically the processors therein (including CPU, GPU, FPGA, and the like) to execute particular processes or particular parts of particular processes described herein, including defining data structures stored in RAM (1946) and modifying such data structures according to the processes defined by the software. In addition or as an alternative, the computer system can provide functionality as a result of logic hardwired or otherwise embodied in a circuit (for example: accelerator (1944)), which can operate in place of or together with software to execute particular processes or particular parts of particular processes described herein. Reference to software can encompass logic, and vice versa, where appropriate. Reference to a computer-readable media can encompass a circuit (such as an integrated circuit (IC)) storing software for execution, a circuit embodying logic for execution, or both, where appropriate. The present disclosure encompasses any suitable combination of hardware and software.

APPENDIX A: ACRONYMS

-   AMVP: Advanced Motion Vector Prediction -   ASIC: Application-Specific Integrated Circuit -   BMS: Benchmark Set -   CANBus: Controller Area Network Bus -   CD: Compact Disc -   CPMV: Control Point Motion Vector -   CPUs: Central Processing Units -   CRT: Cathode Ray Tube -   CTUs: Coding Tree Units -   CU: Coding Unit -   DVD: Digital Video Disc -   FPGA: Field Programmable Gate Areas -   FIFO: First In First Out -   GBi: Generalized Bi-prediction -   GOPs: Groups of Pictures -   GPUs: Graphics Processing Units -   GSM: Global System for Mobile communications -   HDR: High Dynamic Range -   HEVC: High Efficiency Video Coding -   HMVP: History-based Motion Vector Prediction -   HRD: Hypothetical Reference Decoder -   IC: Integrated Circuit -   JEM: Joint Exploration Model -   JVET: Joint Video Exploration Team -   LAN: Local Area Network -   LCD: Liquid-Crystal Display -   LTE: Long-Term Evolution -   MMVD: Merge with MVD -   MV: Motion Vector -   MVD: Motion Vector Difference -   MVP: Motion Vector Predictor -   OLED: Organic Light-Emitting Diode -   PBs: Prediction Blocks -   PCI: Peripheral Component Interconnect -   PLD: Programmable Logic Device -   PPS: Picture Parameter Set -   PUs: Prediction Units -   RAM: Random Access Memory -   RD: Rate Distortion -   ROM: Read-Only Memory -   SDR: Standard Dynamic Range -   SEI: Supplementary Enhancement Information -   SNR: Signal Noise Ratio -   SSD: Solid-State Drive -   SPS: Sequence Parameter Set -   SbTMVP: Subblock-based Temporal Motion Vector Prediction -   TMVP: Temporal Motion Vector Prediction -   TUs: Transform Units, -   USB: Universal Serial Bus -   VTM: Versatile Test Model -   VUI: Video Usability Information -   VVC: Versatile Video Coding

While this disclosure has described several exemplary embodiments, there are alterations, permutations, and various substitute equivalents, which fall within the scope of the disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the disclosure and are thus within the spirit and scope thereof 

What is claimed is:
 1. A method of video encoding in an encoder, comprising: receiving sample values of a current block in a current picture, the current block being divided into a plurality of sub-blocks to be coded according to a sub-block based inter prediction mode; determining pieces of sub-block motion information for the sub-blocks, respectively; generating, according to the pieces of sub-block motion information, respective predictors of the sub-blocks; encoding the sample values of the current block according to the predictors of the sub-blocks and including encoded data of the current block in a bitstream for output; and in response to encoding of the current block, updating, by processing circuitry of the encoder, a history-based motion vector prediction (HMVP) candidate list according to a single new entry that is a particular piece of sub-block motion information from the pieces of sub-block motion information, the particular piece of sub-block motion information corresponding to a particular sub-block of the plurality of sub-blocks at a particular position in the current block.
 2. The method of claim 1, wherein the particular sub-block is at a bottom-right position in the current block.
 3. The method of claim 1, wherein the particular sub-block is at a center position in the current block.
 4. The method of claim 3, wherein the particular sub-block is at the center position in the current block when an upper-left corner of the particular sub-block is at a center of the current block.
 5. The method of claim 1, further comprising: signaling the particular position by control information included in a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), slice header, tile group header, or tile header in the bitstream.
 6. The method of claim 1, wherein the current block is coded according to the sub-block based inter prediction mode that is one of an affine inter prediction mode, a subblock-based temporal motion vector prediction mode, and a triangular inter prediction mode.
 7. The method of claim 1, wherein the current block is a coding unit (CU) in the current picture.
 8. An apparatus, comprising: processing circuitry configured to: receive sample values of a current block in a current picture, the current block being divided into a plurality of sub-blocks to be coded according to a sub-block based inter prediction mode; determine pieces of sub-block motion information for the sub-blocks, respectively; generate, according to the pieces of sub-block motion information, respective predictors of the sub-blocks; encode the sample values of the current block according to the predictors of the sub-blocks and include encoded data of the current block in a bitstream for output; and in response to encoding of the current block, update a history-based motion vector prediction (HMVP) candidate list according to a single new entry that is a particular piece of sub-block motion information from the pieces of sub-block motion information, the particular piece of sub-block motion information corresponding to a particular sub-block of the plurality of sub-blocks at a particular position in the current block.
 9. The apparatus of claim 8, wherein the particular sub-block is at a bottom-right position in the current block.
 10. The apparatus of claim 8, wherein the particular sub-block is at a center position in the current block.
 11. The apparatus of claim 10, wherein the particular sub-block is at the center position in the current block when an upper-left corner of the particular sub-block is at a center of the current block.
 12. The apparatus of claim 8, wherein the processing circuitry is further configured to: signal the particular position by control information included in a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), slice header, tile group header, or tile header in the bitstream.
 13. The apparatus of claim 8, wherein the current block is coded according to the sub-block based inter prediction mode that is one of an affine inter prediction mode, a subblock-based temporal motion vector prediction mode, and a triangular inter prediction mode.
 14. The apparatus of claim 8, wherein the current block is a coding unit (CU) in the current picture.
 15. A non-transitory computer-readable medium storing instructions which when executed by a computer for video encoding cause the computer to perform: receiving sample values of a current block in a current picture, the current block being divided into a plurality of sub-blocks to be coded according to a sub-block based inter prediction mode; deriving pieces of sub-block motion information for the sub-blocks, respectively; generating, according to the pieces of sub-block motion information, respective predictors of the sub-blocks; encoding the sample values of the current block according to the predictors of the sub-blocks and including encoded data of the current block in a bitstream for output; and in response to encoding of the current block, updating a history-based motion vector prediction (HMVP) candidate list according to a single new entry that is a particular piece of sub-block motion information from the pieces of sub-block motion information, the particular piece of sub-block motion information corresponding to a particular sub-block of the plurality of sub-blocks at a particular position in the current block.
 16. The non-transitory computer-readable medium of claim 15, wherein the particular sub-block is at a bottom-right position in the current block.
 17. The non-transitory computer-readable medium of claim 15, wherein the particular sub-block is at a center position in the current block.
 18. The non-transitory computer-readable medium of claim 17, wherein the particular sub-block is at the center position in the current block when an upper-left corner of the particular sub-block is at a center of the current block.
 19. The non-transitory computer-readable medium of claim 15, wherein the instructions when executed by the computer further cause the computer to perform: signaling the particular position by control information included in a Sequence Parameter Set (SPS), Picture Parameter Set (PPS), slice header, tile group header, or tile header in the bitstream.
 20. The non-transitory computer-readable medium of claim 15, wherein the current block is coded according to the sub-block based inter prediction mode that is one of an affine inter prediction mode, a subblock-based temporal motion vector prediction mode, and a triangular inter prediction mode. 